This paper describes a pipelining universal system of discrete time cellular neural networks (DTCNNs). The new relaxation-based algorithm which is called a Pipelining Gauss Seidel (PGS) method is used to solve the CNN state equations in pipelining. In the systolic system of N processor elements {PEi}, each PEi performs the convolusional computation (CC) of all cells and the preceding PEi-1 performs the CC of all cells taking precedence over it by the precedence interval number p. The expected maximum number of PE's for the speeding up is given by n/p where n means the number of cells. For its application, the encoding and decoding process of moving images is simulated.

This paper proposes a semi-autonomous frame synchronization scheme for a TDMA (Time Division Multiple Access)-TDD (Time Division Duplexing) personal communication system to realize accurate frame synchronization in a simple manner. The proposed scheme selects specific adjacent base stations by the station indicator (SID), carries out high resolution frame timing control, and compensates the propagation delay between base stations by using geographical data. This autonomously synchronizes all base stations to each other. Computer simulation and analysis results confirm the accurate and stable TDMA frame synchronization of all base stations even in fading environments.

New communication systems via chaotic modulations are experimentally, demonstrated. They contain the wellknown chaotic circuits as its basic elements--Chua's circuits and canonial Chua's circuits. The following advantage is found in our laboratory experiments: (a) Transmitted signals have broad spectra. (b) Secure communications are possible in the sense that the better parameter matching is required in order to recover the signal. (c) The circuit structure of our communication system is most simple at this stage. (d) The communication systems are easily built at a small outlay.

This paper discusses a way of identifying the network configuration of ATM-LANs, which are composed of a number of ATM hubs. In general, a Network Management System (NMS) sets and gets the necessary data to and from the network elements. In managing an ATM-LAN, the ATM connection between the NMS and each network element, namely the ATM hub, must be established in order to get and set the necessary data. This forms a remarkable contrast with conventional LANs such as the IEEE802.3 LAN, which is a shared media network and enables broadcast communication without setting up any connection. This paper proposes a new protocol and a procedure that establishes the ATM connection between the NMS and each ATM hub, while identifying the overall network configuration. First, this paper makes clear the peculiarity of the ATM-LAN in terms of automatically identifying the network configuration. Next, the identification protocol that achieves the required properties is precisely explained. Then, the proposed identification protocol is evaluated in terms of required bandwidth and identification time.

This paper summarizes basic system design for an optical fiber feeder for microcellular mobile communication systems. The optical feeder enables compact and low cost base stations, easy radio channel control and flexible mobile communication systems. Basic transmission characteristics are investigated through optical transmission experiments. By using these results, feeder performance is estimated and optimal system parameters are designed.

This paper reports performance improvement in an optical fiber feeder for microcellular mobile radio systems. A low noise optical receiver using a transformer resonant circuit is described. With this receiver, CNR degradation due to receiver noise is suppressed to less than 0.9dB. Furthermore, two novel techniques, the use of a multiple-LD transmitter and automatic LD input level control, are proposed. The multiple-LD transmitter increases transmitter output power and reduces the transmitter noise. With a dual-LD transmitter, it is possible to increase the optical loss margin by 3.1dB, which corresponds to transmission length expansion of 6.2km, or to improve the received CNR by 2.8dB, which enables communication range expansion. Automatic LD input level control, which optimizes LD input level according to the received radio power, can expand the actual dynamic range of the up link.

This paper proposes M-ary/SSMA using co-channel interference cancellation techniques and presents comparisons with conventional DS/SSMA and other systems. First, ideal models of DS/SSMA and M-ary/SSMA using co-channel interference cancellation techniques are analyzed. In the cancellation circuit of DS/SSMA, when an error bit of other user's data arises, the received signal is degraded by "voltage addition" of the error sequence. While, in M-ary/SSMA, it is degraded by only "power addition" of the error code. Therefore, though the circuits are complicated, bit error rate of the proposed system can be improved considerably. Further, improvement of spectral efficiency in these systems are shown for several bit error rate and chip waveforms.

Recently, there has been increasing interest in Code Division Multiplex (CDM) systems. We reported the CDM system using the -chip shift multiplex operation. So far the performance of this system evaluated under the optimum . In this letter, we evaluate an influence of the phase difference between the groups on BER performance in 2M-plex system.

Asynchronous Transfer Mode (ATM) is an information transport technique that well supports Broadband ISDN (B-ISDN). One unsolved problem to the perfection of ATM networks is to provide a testing environment that conforms to some standardized network management scheme. From this point of view, remotely controlled virtual path testing is considered in this paper. Remotely controlled virtual path testing should be executed through the standardized Telecommunications Management Network (TMN) model, which employs the OSI systems management concept as the basis of information exchange. Thus, this paper addresses the two issues that arise when OSI systems management standards are applied to virtual path testing. One issue is to define relevant information models. The other issue is to provide test resources with a concurrency control mechanism that guarantees a consistent test environment without causing deadlocks. To resolve these issues, technical requirements are clarified for the remote control of test resources. Next, alternatives to the concurrency control mechanism are shown and compared through computer simulations. A method of defining information models is then proposed. The proposed method ensures the easy storage and retrieval of intermediate test results as well as permitting the effective provision of concurrency control for test resources. An application scenario is also derived. The scenario shows that tests can be executed by using standardized communication services. These results confirm that virtual path testing can be successfully achieved in conformance with the OSI systems management standards.

For the connection request procedure in mobile communication systems, a previous study had shown that the 3-channel systems provide the haighest maximum of stable per channel throughput. In this paper, we propose and study a new algorithm, called the Parallel Collision Resolution Algorithm, which can be implemented in a Q-channel connection request environment, where Q3. For the implementation, the channels are arranged in R groups, where R is a positive integer. The collision resolution scheme distributes the collided messages over all the groups so that throughput and delay measures can be improved. At any point in time, there can be a maximum of R collision resolution schemes operational irrespective of the channel or the group number over which collisions occurred. The performance measures are estimated by computer simulation. Under the new algorithm, almost the same level of the perchannel stable throughput measure of a 3-channel network can be achieved in networks for which Q3. This feature allows freedom to the network designer to employ a higher number of connection request channels without forfeiting high channel utilization rates. When Q is an integral multiple of 3, the maximum stable per channel throughput level achieved can be the same as that achieved by the 3 channel system, if the grouping of channels is such that each group consists of 3 channels. When Q is not an integral multiple of 3, the intuitive strategy of organizing the channels in such a way that Q/3 groups consist of 3 channels each and one group consists of (Q mod 3) channels, may result in much degraded performance. It is found that, if the channels are so organised that no group is composed of (Q mod 3) channels, the performance levels can be substantially enhanced. Also, under the new algorithm, the delay measure is significantly improved, particularly in schemes like the mobile satellite systems with high propagation delays. We conclude that the new scheme presents a promising collision resolution methodology for connection request procedures.

In mobile communication systems using Dynamic Channel Assignment, channels are possible to be rearranged so that blocking probability can be made low. The smaller the number of cells where channels are rearranged, the smaller the load on the base stations in the cells. Also, we can reduce the deterioration of communication quality caused by reassingning a new channel to a call instead of the channel already assigned. In this paper, we consider not only how to rearrange channels but also which channel should be rearranged and assigned to a new call in rearrangement, and propose very simple but effective methods for rearrangement. The ways to select a candidate channel to be rearranged and assigned to a new call in the new methods make the number of cells where a channel is rearranged smaller. We also examine the relations between characteristics and the number of cells where a channel is rearranged. Using computer simulation results, the properties of the new rearrangement methods are compared with those of the traditional methods.

Subscriber network opticalization is the key issue for the next generation network. Fiber-optic systems have been limited to mainly big business applications, so far. Massive opticalization including home and small business customers remains the ultimate goal. Opticalization of the subscriber network needs an enormous investment and a long construction period. In order to achieve smooth evolution towards B-ISDN, the subscriber network must be effectively opticalized well in advance of full B-ISDN deployment. This paper presents the development concept of optical subscriber network. It also describes the design concept and configuration of fiber-optic subscriber systems. Deployment strategies and the developing technologies for the future subscriber network are also addressed.

This paper proposes a knowledge-based design method of a protocol of a communication network system based on the knowledge-based design methodology for computer communication systems. In the proposed method, two knowledge models, i.e., the communication network architecture model (CNAM) and the communication protocol architecture model (CPAM), are introduced and a protocol design task is modeled as a successive transformation process of these knowledge models. Giving CNAM which represents the users' requirements concerning a communication network system, the requirements specification of a protocol is derived from CNAM and represented as CPAM. Then, the detailed requirements specification of a protocol is also derived from CPAM and represented by the formal description technique (FDT-Expressions). The derivations of CPAM and FDT-Expressions are executed by the transformation rules which represent the mappings between knowledge models. Due to formally defined knowledge models and mappings, the proposed method provides a framework of a systematic support of knowledge-based protocol design. In this paper, the formal definitions of CNAM and CPAM are given, then the derivation process of FDT-Expressions of a protocol is also formalized based on these knowledge models. Furthermore, a design example is demonstrated by using LOTOS as one of the FDT-Expressions of a protocol.